A New Approach for the Dominating-Set Problem by DNA-Based Supercomputing

DNA computing has been applied to many different decision or combinatorial problems when being proved of its feasibility in experimental demonstration. In this paper, for the objective to reduce the DNA volume of the dominating set problem which belongs to the NPcomplete problem, the pruning strategy is introduced into the DNA supercomputing and a new DNA algorithm is advanced. The new algorithm consists of a donimating set searcher, a donimating set generator, a parallel searcher and a minimum dominating set searcher. In a computer simulation, the new algorithm is testified to be highly spaceefficient and error-tolerant compared to conventional bruteforce searching.